Termination of the following Term Rewriting System could be disproven:
Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:
if(true) → X
if(false) → Y
minus → 0
minus → minus
geq → true
geq → false
geq → geq
div(0) → 0
div(s(X)) → if(geq)
↳ GTRS
↳ CritRuleProof
Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:
if(true) → X
if(false) → Y
minus → 0
minus → minus
geq → true
geq → false
geq → geq
div(0) → 0
div(s(X)) → if(geq)
The rule if(true) → X contains free variables in its right-hand side. Hence the TRS is not-terminating.